This paper presents a novel SAT-based approach for the computation\udof extensions in abstract argumentation, with focus on preferred semantics, and\udan empirical evaluation of its performances. The approach is based on the idea\udof reducing the problem of computing complete extensions to a SAT problem\udand then using a depth-first search method to derive preferred extensions. The\udproposed approach has been tested using two distinct SAT solvers and compared\udwith three state-of-the-art systems for preferred extension computation. It turns\udout that the proposed approach delivers significantly better performances in the\udlarge majority of the considered cases.
展开▼
